Completion-of-squares: Revisited and extended
نویسندگان
چکیده
Due to its simplicity, the completion-of-squares technique is quite popular in linear optimal control. However, this simple technique is limited to linear quadratic Gaussian systems. In this note, by interpreting the completion-ofsquares from a new angle, we extend this technique to performance optimization of general Markov systems with the long run average criterion, leading to a new approach to performance optimization based on direct comparisons of the performance of two policies.
منابع مشابه
Return Predictability Revisited Using Weighted Least Squares
I show that important conclusions about time-series return predictability change when using least squares estimates weighted by ex-ante return variance (WLS-EV) instead of OLS. In small-sample simulations, WLS-EV results in large efficiency gains relative to OLS, fewer false negatives, and avoids the bias associated with ex-post weighting schemes. Empirically, traditional predictors such as the...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملExamining the Perceived Consequences and Usage of MOOCs on Learning Effectiveness
Massive Open Online Courses (MOOCs) have recently received a great deal of attention from the academic communities. However, these courses face low completion rates and there are very limited research pertaining to this problem. Therefore, this study uses Triandis theory to better understand variables that are indicative of MOOC completion. Furthermore, this study scrutinizes the quantitative r...
متن کاملExact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks
Robustness in biological networks can be regarded as an important feature of living systems. A system maintains its functions against internal and external perturbations, leading to topological changes in the network with varying delays. To understand the flexibility of biological networks, we propose a novel approach to analyze time-dependent networks, based on the framework of network complet...
متن کاملInterpolation using Hankel tensor completion
We present a novel multidimensional seismic trace interpolator that works on constant-frequency slices. It performs completion on Hankel tensors whose order is twice the number of spatial dimensions. Completion is done by fitting a PARAFAC model using an Alternating Least Squares algorithm. The new interpolator runs quickly and can better handle large gaps and high sparsity than existing comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 60 شماره
صفحات -
تاریخ انتشار 2011